Pooling semilattices and non-adaptive pooling designs
نویسندگان
چکیده
منابع مشابه
Pooling semilattices and non-adaptive pooling designs
In Huang and Weng (2004), Huang and Weng introduced pooling spaces, and constructed pooling designs from a pooling space. In this paper, we introduce the concept of pooling semilattices and prove that a pooling semilattice is a pooling space, then show how to construct pooling designs from a pooling semilattice. Moreover, we give many examples of pooling semilattices and thus obtain the corresp...
متن کاملPooling spaces and non-adaptive pooling designs
A pooling space is defined to be a ranked partially ordered set with atomic intervals. We show how to construct non-adaptive pooling designs from a pooling space. Our pooling designs are e-error detecting for some e; moreover e can be chosen to be very large compared with the maximal number of defective items. Eight new classes of nonadaptive pooling designs are given, which are related to the ...
متن کاملNew constructions of non-adaptive and error-tolerance pooling designs
We propose two new classes of non-adaptive pooling designs. The first one is guaranteed to be -error-detecting and thus -error-correcting, where , a positive integer, is the maximum number of defectives (or positives). Hence, the number of errors which can be detected grows linearly with the number of positives. Also, this construction induces a construction of a binary code with minimum Hammin...
متن کاملNew Construction of Error-Tolerant Pooling Designs
We present a new class of error-tolerant pooling designs by constructing d−disjunct matrices associated with subspaces of a finite vector space.
متن کاملEfficient pooling designs for library screening.
We describe efficient methods for screening clone libraries, based on pooling schemes that we call "random k-sets designs." In these designs, the pools in which any clone occurs are equally likely to be any possible selection of k from the v pools. The values of k and v can be chosen to optimize desirable properties. Random k-sets designs have substantial advantages over alternative pooling sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2014
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.12.004